An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولgenetic algorithms for assembly line balancing problem
there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملA novel bi-level stochastic programming model for supply chain network design with assembly line balancing under demand uncertainty
This paper investigates the integration of strategic and tactical decisions in the supply chain network design (SCND) considering assembly line balancing (ALB) under demand uncertainty. Due to the decentralized decisions, a novel bi-level stochastic programming (BLSP) model has been developed in which SCND problem has been considered in the upper-level model, while the lower-level model contain...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1984
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.30.1.85